最大流最小割定理-maximum flow minimum cut theorem

Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, endin

基于块拼接的纹理合成算法实现，在最小误差路径切割时做了修改，在重叠区域寻找回溯点再同时向下和向右寻找切割路径-Splicing block-based texture synthesis algorithm, the minimum error path of the cutting was revised, in the overlapping area at the same time looking for back points and then cut down and find th

WebFTP为浩天科技开发的PHP在线文件管理系统，系统采用Ajax+Json进行数据通信，毫秒级的响应速度，强大的文件管理功能足以媲美专业的FTP软件；高度集中的操作接口，将系统BUG、漏洞出现几率降到最低，便捷的权限拦截方案；全平台兼容性：Win(IIS+Apache)、Linux(Apache) 支持中英文目录名及文件名； 功能简介 目录：剪切、复制、粘贴、删除、压缩、打包下载、权限设置、目录属性查看... 文件：剪切、复制、粘贴、删除、压缩(ZIP解压、预览)、打